Improved approximations for max set splitting and max NAE SAT

Improved approximations for max set splitting and max NAE SAT

Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT

MAX SAT and MAX NAE-SAT are central problems in theoretical computer science. We present an approximation algorithm for MAX NAE-SAT with a conjectured performance guarantee of 0.8279. This improves a previously conjectured performance guarantee of 0.7977 of Zwick [Zwi99]. Using a variant of our MAX NAE-SAT approximation algorithm, combined with other techniques used in [Asa03], we obtain an app...

Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP

We give improved deterministic algorithms solving sparse instances of MAX-SAT and MAX-k-CSP. For instances with n variables and cn clauses (constraints), we give algorithms running in time poly(n)· 2n(1−μ) for – μ = Ω( 1 c ) and polynomial space solving MAX-SAT and MAX-kSAT, – μ = Ω( 1 √ c ) and exponential space solving MAX-SAT and MAX-kSAT, – μ = Ω( 1 ck2 ) and polynomial space solving MAX-k-...

Improved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT

We present novel branch and bound algorithms for solving Max-SAT and weighted Max-SAT, and provide experimental evidence that outperform the algorithm of Borchers & Furman on Max-2-SAT and weighted Max-2-SAT instances. Our algorithms decrease the time needed to solve an instance, as well as the number of backtracks, up to two orders of magnitude.

Improved Exact Algorithms for MAX-SAT

In this paper we present improved exact and parameterized algorithms for the maximum satisfiability problem. In particular, we give an algorithm that computes a truth assignment for a boolean formula F satisfying the maximum number of clauses in time O(1.3247|F |), where m is the number of clauses in F , and |F | is the sum of the number of literals appearing in each clause in F . Moreover, giv...